翻訳と辞書 Words near each other ・ King's Quest V ・ King's Quest VI ・ King's Quest VII ・ King's Rangers ・ King's Ransom ・ King's Ransom (film) ・ King's Ransom (novel) ・ King's Record Shop ・ King's Garden (Odense) ・ King's Gate ・ King's Gate (Kaliningrad) ・ King's German Legion ・ King's Glory Education Centre ・ King's Gold ・ King's Gold Cup ・ King's graph ・ King's Group ・ King's Grove High School ・ King's Hall ・ King's Hall School ・ King's Hall, Belfast ・ King's Hall, Cambridge ・ King's Hall, Herne Bay ・ King's Hawaiian ・ King's Head ・ King's Head Inn, Aylesbury ・ King's Head Mill, Battle ・ King's Head Society ・ King's Head Theatre ・ King's Head, Merton Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク King's graph ： ウィキペディア英語版 King's graph In graph theory, a king's graph is a graph that represents all legal moves of the king chess piece on a chessboard where each vertex represents a square on a chessboard and each edge is a legal move. More specifically, an $n\; \backslash times\; m$ king's graph is a king's graph of an $n\; \backslash times\; m$ chessboard.〔. Chang defines the king's graph on (p. 341 ).〕 For a $n\; \backslash times\; m$ king's graph the total number of vertices is simply $n\; m$. For a $n\; \backslash times\; n$ king's graph the total number of vertices is simply $n^2$ and the total number of edges is $(2n-2)(2n-1)$. The neighbourhood of a vertex in the king's graph corresponds to the Moore neighborhood for cellular automata.〔.〕 A generalization of the king's graph, called a kinggraph, is formed from a squaregraph (a planar graph in which each bounded face is a quadrilateral and each interior vertex has at least four neighbors) by adding the two diagonals of every quadrilateral face of the squaregraph.〔.〕 ==References== 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「King's graph」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.